A Lattice Theory for Solving Games of Imperfect Information
نویسندگان
چکیده
In this paper, we propose a fixed point theory to solve games of imperfect information. The fixed point theory is defined on the lattice of antichains of sets of states. Contrary to the classical solution proposed by Reif [Rei84], our new solution does not involve determinization. As a consequence, it is readily applicable to classes of systems that do not admit determinization. Notable examples of such systems are timed and hybrid automata. As an application, we show that the discrete control problem for games of imperfect information defined by rectangular automata is decidable. This result extends a result by Henzinger and Kopke in [HK99].
منابع مشابه
Òøöö Öö Ò Îîööö Blockin Blockinøøóò a Lattice Theory for Solving Games of Imperfect Information
In this paper, we propose a fixed point theory to solve games of imperfect information. The fixed point theory is defined on the lattice of antichains of sets of states. Contrary to the classical solution proposed by Reif [Rei84], our new solution does not involve determinization. As a consequence, it is readily applicable to classes of systems that do not admit determinization. Notable example...
متن کاملSolving Imperfect Recall Games (Doctoral Consortium)
Imperfect recall games remain an unexplored part of the game theory, even though recent results in abstraction algorithms show that the imperfect recall might be the key to solving the immense games found in the real world efficiently. Our research objective is to develop the first algorithm capable of outperforming the state-of-the-art solvers applied directly to perfect recall games, by creat...
متن کاملSafe and Nested Endgame Solving for Imperfect-Information Games
Unlike perfect-information games, imperfect-information games cannot be decomposed into subgames that are solved independently. Thus more computationally intensive equilibrium-finding techniques are used, and abstraction— in which a smaller version of the game is generated and solved—is essential. Endgame solving is the process of computing a (presumably) better strategy for just an endgame tha...
متن کاملEndgame Solving in Large Imperfect-Information Games
The leading approach for computing strong game-theoretic strategies in large imperfect-information games is to first solve an abstracted version of the game offline, then perform a table lookup during game play. We consider a modification to this approach where we solve the portion of the game that we have actually reached in real time to a greater degree of accuracy than in the initial computa...
متن کاملSafe and Nested Subgame Solving for Imperfect-Information Games
Unlike perfect-information games, imperfect-information games cannot be solved by decomposing the game into subgames that are solved independently. Thus all decisions must consider the strategy of the game as a whole. While it is not possible to solve an imperfect-information game exactly through decomposition, it is possible to approximate solutions, or improve existing solutions, by solving d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006